例句與造句

1. A signed graph is called " balanced " if the product of the signs of all relations in every cycle ( links in every graph cycle ) is positive.
2. Note that the problem of deleting as few " edges " as possible to make the graph cycle-free is equivalent to finding a spanning tree, which can be done in polynomial time.
3. On the other hand, if the edges are undirected, the problem of deleting edges to make the graph cycle-free is equivalent to finding a minimum spanning tree, which can be done easily in polynomial time.
4. It's difficult to find graph cycle in a sentence. 用graph cycle造句挺難的